H ∞ Synthesis via a Nonsmooth, Nonconvex Optimization Approach
نویسندگان
چکیده
A numerical method for solving the H∞ synthesis problem is presented. The problem is posed as an unconstrained, nonsmooth, nonconvex minimization problem. The optimization variables consist solely of the entries of the output feedback matrix. No additional variables, such as Lyapunov variables, need to be introduced. The main part of the optimization procedure uses a line search mechanism where the descent direction is defined by a recently introduced dynamical systems approach. Numerical results for various benchmark problems are included in the paper. In addition, the effectiveness of a preliminary part of the algorithm for successfully and quickly finding stabilizing controllers is also demonstrated.
منابع مشابه
Benson's algorithm for nonconvex multiobjective problems via nonsmooth Wolfe duality
In this paper, we propose an algorithm to obtain an approximation set of the (weakly) nondominated points of nonsmooth multiobjective optimization problems with equality and inequality constraints. We use an extension of the Wolfe duality to construct the separating hyperplane in Benson's outer algorithm for multiobjective programming problems with subdifferentiable functions. We also fo...
متن کاملA Nonsmooth Optimization Approach to H∞ Synthesis
A numerical method for solving the H∞ synthesis problem is presented. The problem is posed as an unconstrained, nonsmooth, nonconvex minimization problem. The optimization variables consist solely of the entries of the output feedback matrix. No additional variables, such as Lyapunov variables, need to be introduced. The optimization procedure uses a line search mechanism where the descent dire...
متن کاملA Nonsmooth Optimization Approach to H-Infinity Synthesis
A numerical method for solving the H∞ synthesis problem is presented. The problem is posed as an unconstrained, nonsmooth, nonconvex minimization problem. The optimization variables consist solely of the entries of the output feedback matrix. No additional variables, such as Lyapunov variables, need to be introduced. The optimization procedure uses a line search mechanism where the descent dire...
متن کاملA Trust Region Spectral Bundle Method for Nonconvex Eigenvalue Optimization
We present a nonsmooth optimization technique for nonconvex maximum eigenvalue functions and for nonsmooth functions which are infinite maxima of eigenvalue functions. We prove global convergence of our method in the sense that for an arbitrary starting point, every accumulation point of the sequence of iterates is critical. The method is tested on several problems in feedback control synthesis.
متن کاملH2 for HIFOO
HIFOO is a public-domain Matlab package initially designed for H∞ fixed-order controller synthesis, using nonsmooth nonconvex optimization techniques. It was later on extended to multi-objective synthesis, including strong and simultaneous stabilization under H∞ constraints. In this paper we describe a further extension of HIFOO to H2 performance criteria, making it possible to address mixed H2...
متن کامل